A phase semantics for polarized linear logic and second order conservativity
نویسندگان
چکیده
This paper presents a polarized phase semantics, with respect to which the linear fragment of second order polarized linear logic of [Laurent 99] is complete. This is done by adding a topological structure to Girard’s phase semantics [Girard 87]. The topological structure results naturally from the categorical construction developed in [Hamano-Scott 07]. The polarity shifting operator ↓ (resp. ↑) is interpreted as an interior (resp. closure) operator in such a manner that positive (resp. negative) formulas correspond to open (resp. closed) facts. By accommodating the exponentials of linear logic, our model is extended to the polarized fragment of the second order linear logic. Strong forms of completeness theorems are given to yield cut-eliminations for the both second order systems. As an application of our semantics, the first order conservativity of linear logic is studied over its polarized fragment of [Laurent 02]. Using a counter model construction, the extension of this conservativity is shown to fail into the second order, whose solution is posed as an open problem in [Laurent 02]. After this negative result, a second order conservativity theorem is proved for an eta expanded fragment of the second order linear logic, which fragment retains a focalized sequent property of [Andreoli 92].
منابع مشابه
The enriched effect calculus: syntax and semantics
This paper introduces the enriched effect calculus, which extends established type theories for computational effects with primitives from linear logic. The new calculus provides a formalism for expressing linear aspects of computational effects; for example, the linear usage of imperative features such as state and/or continuations. The enriched effect calculus is implemented as an extension o...
متن کاملRandomized Game Semantics for Semi-fuzzy Quantifiers
A propositional proof system is weakly automatizable if there is a polynomial time algorithm that separates satisfiable formulas from formulas that have a short refutation in the system, with respect to a given length bound. We show that if the resolution proof system is weakly automatizable, then parity games can be decided in polynomial time. We give simple proofs that the same holds for dept...
متن کاملThe Undecidability of Second Order Linear Logic Without Exponentials
Recently, Lincoln, Scedrov and Shankar showed that the multi-plicative fragment of second order intuitionistic linear logic is undecidable, using an encoding of second order intuitionistic logic. Their argument applies to the multiplicative-additive fragment, but it does not work in the classical case, because second order classical logic is decidable. Here we show that the multiplicative-addit...
متن کاملDi erential Linear Logic and Polarization
We extend Ehrhard Regnier's di erential linear logic along the lines of Laurent's polarization. We provide a denotational semantics of this new system in the well-known relational model of linear logic, extending canonically the semantics of both di erential and polarized linear logics: this justi es our choice of cut elimination rules. Then we show this polarized di erential linear logic re ne...
متن کاملA categorical semantics for polarized MALL
In this paper, we present a categorical model for Multiplicative Additive Polarized Linear Logic MALLP, which is the linear fragment (without structural rules) of Olivier Laurent’s Polarized Linear Logic. Our model is based on an adjunction between reflective/coreflective full subcategories C−/C+ of an ambient ∗-autonomous category C (with products). Similar structures were first introduced by ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Symb. Log.
دوره 75 شماره
صفحات -
تاریخ انتشار 2010